Improved Dispatching Algorithm for Satisfying both Quality and Due Date
نویسندگان
چکیده
منابع مشابه
A Column Generation Algorithm for Common Due Date Scheduling
We consider the single-machine problem of scheduling n jobs to minimize the total weighted deviation from a given common due date, where the weights for early and tardy completion are asymmetric. First, we assume that the common due date is large. We formulate this problem as an integer linear program with an exponential number of variables and present a column generation algorithm to solve e c...
متن کاملAccelerating Products under Due-date Oriented Dispatching Rules in Semiconductor Manufacturing
In semiconductor manufacturing facilities, there is often the need to speed up certain product types. This is usually done by either assigning higher priorities or by reducing due dates. In this paper, we study the effects of accelerating one product type by a tighter due date on the on-time delivery performance of the other products manufactured. It turns out that the results depend on the con...
متن کاملImproved Cuckoo Search Algorithm for Global Optimization
The cuckoo search algorithm is a recently developedmeta-heuristic optimization algorithm, which is suitable forsolving optimization problems. To enhance the accuracy andconvergence rate of this algorithm, an improved cuckoo searchalgorithm is proposed in this paper. Normally, the parametersof the cuckoo search are kept constant. This may lead todecreasing the efficiency of the algorithm. To cop...
متن کاملAn Improved Algorithm for Network Reliability Evaluation
Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...
متن کاملAn efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs
We consider a single-machine scheduling problem with equal-sized jobs. The objective is to minimize the maximum weighted earliness-tardiness and due-date costs. We present an algorithm to solve this problem. Our algorithm makes use of bottleneck jobs and priority queues, and has a computational complexity of O(n logn). This complexity is a significant improvement of the existing algorithm in th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korea Academia-Industrial cooperation Society
سال: 2008
ISSN: 1975-4701
DOI: 10.5762/kais.2008.9.6.1838